To appear in Stochastic Analysis and Applications STOCHASTIC INEQUALITIES FOR SINGLE-SERVER LOSS QUEUEING SYSTEMS
نویسنده
چکیده
The present paper provides some new stochastic inequalities for the characteristics of the M/GI/1/n and GI/M/1/n loss queueing systems. These stochastic inequalities are based on substantially deepen upand downcrossings analysis, and they are stronger than the known stochastic inequalities obtained earlier. Specifically, for a class of GI/M/1/n queueing system, twoside stochastic inequalities are obtained.
منابع مشابه
Stochastic inequalities for single-server loss queueing systems
The present paper provides some new stochastic inequalities for the characteristics of the M/GI/1/n and GI/M/1/n loss queueing systems. These stochastic inequalities are based on substantially deepen upand down-crossings analysis, and they are stronger than the known stochastic inequalities obtained earlier. Specifically, for a class of GI/M/1/n queueing system, two-side stochastic inequalities...
متن کاملStochastic inequalities for single-server loss queueing systems and their application
The present paper provides some new stochastic inequalities for the characteristics of the M/GI/1/n and GI/M/1/n loss queueing systems. These stochastic inequalities are based on substantially deepen upand down-crossings analysis, and they are stronger than the known stochastic inequalities obtained earlier. Specifically, for a class of GI/M/1/n queueing system, two-side stochastic inequalities...
متن کاملNetwork Location Problem with Stochastic and Uniformly Distributed Demands
This paper investigates the network location problem for single-server facilities that are subject to congestion. In each network edge, customers are uniformly distributed along the edge and their requests for service are assumed to be generated according to a Poisson process. A number of facilities are to be selected from a number of candidate sites and a single server is located at each facil...
متن کاملA stochastic version analysis of an M/G/1 retrial queue with Bernoulli schedule
In this work, we derive insensitive bounds for various performance measures of a single-server retrial queue with generally distributed inter-retrial times and Bernoulli schedule, under the special assumption that only the customer at the head of the orbit queue (i.e., a FCFS discipline governing the flow from the orbit to the server) is allowed to occupy the server. The method...
متن کاملStochastic bounds for a single server queue with general retrial times
We propose to use a mathematical method based on stochastic comparisons of Markov chains in order to derive performance indice bounds. The main goal of this paper is to investigate various monotonicity properties of a single server retrial queue with first-come-first-served (FCFS) orbit and general retrial times using the stochastic ordering techniques.
متن کامل